Time Complexity of a Parallel Conjugate Gradient Solver for Light Scattering Simulations: Theory and SPMD Implementation

نویسندگان

  • A. G. Hoekstra
  • L. O. Hertzberger
چکیده

We describe parallelization for distributed memory computers of a preconditioned Conjugate Gradient method, applied to solve systems of equations emerging from Elastic Light Scattering simulations. The execution time of the Conjugate Gradient method is analyzed theoretically. First expressions for the execution time for three different data decompositions are derived. Next two processor network topologies are taken into account and the theoretical execution times are further specified as a function of these topologies. The Conjugate Gradient method was implemented with a rowblock data decomposition on a ring of transputers. The measured and theoretically calculated execution times agree within 5 %. Finally convergence properties of the algorithm are investigated and the suitability of a polynomial preconditioner is examined.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Solution of Systems of Linear Equations using the Conjugate Gradient Method on the Parallel MUSIC - System

The solution of large sparse systems of linear equations is one of the most computationally intensive parts of nite element simulations. In order to solve these systems of linear equations, we have implemented a parallel conjugate gradient solver on the SPMD-programmable MUSIC-system. We outline the conjugate gradient method, give a formal speci cation in Maple, and describe a data-parallel pro...

متن کامل

The Solution of Systems of Linear Equationsusing the Conjugate Gradient

The solution of large sparse systems of linear equations is one of the most compu-tationally intensive parts of nite element simulations. In order to solve these systems of linear equations, we have implemented a parallel conjugate gradient solver on the SPMD-programmable MUSIC-system. We outline the conjugate gradient method, give a formal speciication in Maple, and describe a data-parallel pr...

متن کامل

Implementation of the direction of arrival estimation algorithms by means of GPU-parallel processing in the Kuda environment (Research Article)

Direction-of-arrival (DOA) estimation of audio signals is critical in different areas, including electronic war, sonar, etc. The beamforming methods like Minimum Variance Distortionless Response (MVDR), Delay-and-Sum (DAS), and subspace-based Multiple Signal Classification (MUSIC) are the most known DOA estimation techniques. The mentioned methods have high computational complexity. Hence using...

متن کامل

Advancing Analysis Capabilities in Ansys through Solver Technology

This paper describes substantial improvements in analysis capabilities in a large scale commercial finite element program made possible by the implementation of solver technology. The ANSYS program is a commercial finite element analysis program, which has been in use for thirty years. The original code, developed around a direct frontal solver has been expanded over the years to include full f...

متن کامل

Time complexity analysis for distributed memory computers Implementation of a parallel Conjugate Gradient methodI

New developments in Computer Science, both hardware and software, offer researchers, such as physicists, unprecedented possibilities to solve their computational intensive problems. However, full exploitation of e.g. new massively parallel computers, parallel languages or runtime environments requires an approach that combines elements of computer science, numerical mathematics and, in our case...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1992